An Alternative Approach using Genetic Algorithm Based Heuristics for Capacitated Maximal Covering Location Allocation Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Alternative Approach using Genetic Algorithm Based Heuristics for Capacitated Maximal Covering Location Allocation Problem

The Maximal Covering Location Problem (MCLP) has the objective of maximizing the total demand volume covered by a facility within a maximum allowable travel distance, S. In this paper, three sets of data 30-node, 324-node and 818-node networks with no existing facilities are analyzed as the capacitated model of MCLP (CMCLP) and first solved by the commercial optimization software, CPLEX. As the...

متن کامل

Hybrid heuristics for the probabilistic maximal covering location-allocation problem

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering locationallocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This pa...

متن کامل

Using the Constructive Genetic Algorithm for Solving the Probabilistic Maximal Covering Location-Allocation Problem

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering location-allocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. In thi...

متن کامل

A Constructive Genetic Algorithm for the Maximal Covering Location Problem

The Constructive Genetic Algorithm (CGA) was proposed by Lorena and Furtado [6], as an alternative to the traditional GAs approach. Particularly the CGA directly evaluates schemata, works with a dynamic population size, performs mutation in complete structures, and uses heuristics in schemata and/or structure representation. The schemata are evaluated and can be added to the population if they ...

متن کامل

Reliable Capacitated Facility Location Problem Considering Maximal Covering

This paper provides a framework in order to incorporate reliability issue as a sign of disruption in distribution systems and partial covering theory as a response to limitation in coverage radios and economical preferences, simultaneously into the traditional literatures of capacitated facility location problems. As a result we develop a bi-objective model based on the discrete scenarios for e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations and Supply Chain Management: An International Journal

سال: 2014

ISSN: 2579-9363

DOI: 10.31387/oscm060036